The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions
نویسندگان
چکیده
منابع مشابه
On the existence of nonnegative solutions for a class of fractional boundary value problems
In this paper, we provide sufficient conditions for the existence of nonnegative solutions of a boundary value problem for a fractional order differential equation. By applying Kranoselskii`s fixed--point theorem in a cone, first we prove the existence of solutions of an auxiliary BVP formulated by truncating the response function. Then the Arzela--Ascoli theorem is used to take $C^1$ ...
متن کاملEasy Problems are Sometimes Hard
We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that problem classes and regions of the phase transition previously thought to be easy can sometimes be...
متن کاملOn Reduced Rank Nonnegative Matrix Factorization for Symmetric Nonnegative Matrices
Let V ∈ R be a nonnegative matrix. The nonnegative matrix factorization (NNMF) problem consists of finding nonnegative matrix factors W ∈ R and H ∈ R such that V ≈ WH. Lee and Seung proposed two algorithms which find nonnegative W and H such that ‖V −WH‖F is minimized. After examining the case in which r = 1 about which a complete characterization of the solution is possible, we consider the ca...
متن کاملFinding Low-rank Solutions to Matrix Problems, Efficiently and Provably
A rank-r matrix X ∈ Rm×n can be written as a product UV >, where U ∈ Rm×r andV ∈ Rn×r. One could exploit this observation in optimization: e.g., consider the minimizationof a convex function f(X) over rank-r matrices, where the scaffold of rank-r matrices is modeledvia the factorization in U and V variables. Such heuristic has been widely used before forspecific problem inst...
متن کاملHard and Easy Distributions of SAT Problems
We report results from large-scale experiments in satis-ability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satissability testing is quite diicult....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 2017
ISSN: 0036-1445,1095-7200
DOI: 10.1137/16m1080999